Quantum codes from superelliptic curves
نویسندگان
چکیده
Let X be an algebraic curve of genus g ≥ 2 defined over a field Fq of characteristic p > 0. From X , under certain conditions, we can construct an algebraic geometry code CX . When this code (or its dual) is self-orthogonal under the symplectic product, a quantum algebraic geometry code QX is constructed. In this paper we study the construction of such codes from curves with automorphisms and the relation between the automorphism group of the curve X and the codes CX and QX .
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملArithmetic on superelliptic curves
superelliptic curves, jacobians, cryptography, discrete logarithm problem In this paper we present an efficient, polynomial-time method to perform calculations in the divisor class group of a curve which has a single point on its normalization above infinity. In particular, we provide a unique representation of divisor classes and an algorithm for reducing a divisor on such a curve to its corre...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملAn Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves
We present an algorithm for counting points on superelliptic curves y = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorithm for hyperelliptic curves due to Kedlaya. In this extension, the complexity, assuming r and the genus are fixed, is O(log q) in time and space, just like for hyperelliptic curves. We give some numerical examples obtaine...
متن کاملImplementing the Arithmetic of C3, 4Curves
We provide explicit formulae for realising the group law in Jacobians of superelliptic curves of genus 3 and C3,4 curves. It is shown that two distinct elements in the Jacobian of a C3,4 curve can be added with 150 multiplications and 2 inversions in the field of definition of the curve, while an element can be doubled with 174 multiplications and 2 inversions. In superelliptic curves, 10 multi...
متن کامل